Canonical Presentations ?

Canonical Presentations ? Nachum Dershowitz 1 School of Computer Science Tel-Aviv University P.O. Box 39040 Ramat Aviv, Tel Aviv 69978 Israel Claude Kirchner LORIA & INRIA 615, rue du Jardin Botanique B.P. 101 54602 Villers-lès-Nancy Cedex France Abstract Solving goals—like proving properties, deciding word problems or resolving constraints—is much easier with some presentations of the underlying theory than with others. What have been called “completion processes”, in particular in the study of equational logic, involve finding appropriate presentations of a given theory to more easily solve a given class of problems. We provide a general proof-theoretic setting that relies directly on the fundamental concept of “good” (that is, normal-form) proofs, itself defined using well-founded orderings on proof objects. This foundational framework allows for abstract definitions of canonical presentations and very general characterizations of saturation and redundancy criteria.Solving goals—like proving properties, deciding word problems or resolving constraints—is much easier with some presentations of the underlying theory than with others. What have been called “completion processes”, in particular in the study of equational logic, involve finding appropriate presentations of a given theory to more easily solve a given class of problems. We provide a general proof-theoretic setting that relies directly on the fundamental concept of “good” (that is, normal-form) proofs, itself defined using well-founded orderings on proof objects. This foundational framework allows for abstract definitions of canonical presentations and very general characterizations of saturation and redundancy criteria.